A tutorial on geometric programming

A Tutorial on Geometric Programming

A geometric program (GP) is a type of mathematical optimization problem characterized by objective and constraint functions that have a special form. Recently developed solution methods can solve even large-scale GPs extremely efficiently and reliably; at the same time a number of practical problems, particularly in circuit design, have been found to be equivalent to (or well approximated by) G...

A Tutorial on Constraint Programming

A constraint satisfaction problem (CSP) consists of a set of variables; for each variable, a nite set of possible values (its domain); and a set of constraints restricting the values that the variables can simultaneously take. A solution to a CSP is an assignment of a value from its domain to every variable, in such a way that every constraint is satis ed. Many problems arising in O.R., in part...

A Tutorial on Stochastic Programming

This tutorial is aimed at introducing some basic ideas of stochastic programming. The intended audience of the tutorial is optimization practitioners and researchers who wish to acquaint themselves with the fundamental issues that arise when modeling optimization problems as stochastic programs. The emphasis of the paper is on motivation and intuition rather than technical completeness (althoug...

A Tutorial on Geometric Control Theory

This tutorial consists of three parts: 1. Basic concepts, 2. Basic results, 3. Steering with piecewise constant inputs. The goal is to present only the necessary minimum to understand part 3, which describes a constructive procedure for steering affine drift-free systems using piecewise constant inputs. All technical details will be omitted. The reader is referred to the literature at the end f...

Tutorial On Strategic Programming Across Programming Paradigms